Sparse points matching by combining 3D mesh saliency with statistical descriptors

نویسندگان

  • Umberto Castellani
  • Marco Cristani
  • Simone Fantoni
  • Vittorio Murino
چکیده

This paper proposes new methodology for the detection and matching of salient points over several views of an object. The process is composed by three main phases. In the first step, detection is carried out by adopting a new perceptually-inspired 3D saliency measure. Such measure allows the detection of few sparse salient points that characterize distinctive portions of the surface. In the second step, a statistical learning approach is considered to describe salient points across different views. Each salient point is modelled by a Hidden Markov Model (HMM), which is trained in an unsupervised way by using contextual 3D neighborhood information, thus providing a robust and invariant point signature. Finally, in the third step, matching among points of different views is performed by evaluating a pairwise similarity measure among HMMs. An extensive and comparative experimental session has been carried out, considering real objects acquired by a 3D scanner from different points of view, where objects come from standard 3D databases. Results are promising, as the detection of salient points is reliable, and the matching is robust and accurate.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Signature of Geometric Centroids for 3D Local Shape Description and Partial Shape Matching

Depth scans acquired from different views may contain nuisances such as noise, occlusion, and varying point density. We propose a novel Signature of Geometric Centroids descriptor, supporting direct shape matching on the scans, without requiring any preprocessing such as scan denoising or converting into a mesh. First, we construct the descriptor by voxelizing the local shape within a uniquely ...

متن کامل

Multi-scale mesh saliency based on low-rank and sparse analysis in shape feature space

a r t i c l e i n f o a b s t r a c t Keywords: Saliency Low-rank and sparse analysis Shape feature Structure This paper advocates a novel multi-scale mesh saliency method using the powerful low-rank and sparse analysis in shape feature space. The technical core of our approach is a new shape descriptor that embraces both local geometry information and global structure information in an integra...

متن کامل

Surface matching with salient keypoints in geodesic scale space

This paper develops a new salient keypoints-based shape description which extracts the salient surface keypoints with detected scales. Salient geometric features can then be defined collectively on all the detected scale normalized local patches to form a shape descriptor for surface matching purpose. The saliency-driven keypoints are computed as local extrema of the difference of Gaussian func...

متن کامل

Shape context based mesh saliency detection and its applications: A survey

Mesh saliency was introduced and joined the community of computer graphics ten years ago, which can benefit various applications, for instance, mesh reduction, mesh segmentation, self-similarity matching, scan integration, volume rendering, 3D printing, etc. Before, saliency detection had been successfully applied to image processing and pattern recognition to study how the world is perceptuall...

متن کامل

Inference of Surfaces, 3D Curves, and Junctions From Sparse, Noisy, 3D Data

We address the problem of obtaining dense surface information from a sparse set of 3D data in the presence of spurious noise samples. The input can be in the form of points, or points with an associated tangent or normal, allowing both position and direction to be corrupted by noise. Most approaches treat the problem as an interpolation problem, which is solved by fitting a surface such as a me...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 27  شماره 

صفحات  -

تاریخ انتشار 2008